Non-conforming Domain Decomposition Method for Plate and Shell Problems
نویسنده
چکیده
The mortar element method is an optimal domain decomposition method for the approximation of partial differential equations on non-matching grids. There already exists applications of the mortar method to Navier-Stokes, elasticity, and Maxwell problems. The aim of this paper is to provide an extension of the mortar method to plates and shells problems. We first recall the Discrete Kirchhoff Triangles element method (D.K.T.) to approximate the plate and shell equations. The aim of this paper is then to explain what has to be changed in the definition of the D.K.T. method when the triangulation is nonconforming. Numerical results will illustrate the optimality of the mortar element method extended to shell problems and the efficiency of the FETI solution algorithm.
منابع مشابه
Uniaxial Buckling Analysis Comparison of Nanoplate and Nanocomposite Plate with Central Square Cut out Using Domain Decomposition Method
A comparison of the buckling analysis of the nanoplate and nanocomposite plate with a central square hole embedded in the Winkler foundation is presented in this article. In order to enhance the mechanical properties of the nanoplate with a central cutout, the uniformly distributed carbon nanotubes (CNTs) are applied through the thickness direction. In order to define the shape function of the ...
متن کاملSchwarz Domain Decomposition Preconditioners for Interior Penalty Approximations of Elliptic Problems
We present a two-level non-overlapping additive Schwarz method for Discontinuous Galerkin approximations of elliptic problems. In particular, a two level-method for both symmetric and non-symmetric schemes will be considered and some interesting features, which have no analog in the conforming case, will be discussed. Numerical experiments on non-matching grids will be presented.
متن کاملA BDDC Algorithm for Mortar Discretization of Elasticity Problems
Abstract. A BDDC (balancing domain decomposition by constraints) algorithm is developed for elasticity problems in three dimensions with mortar discretization on geometrically nonconforming subdomain partitions. Coarse basis functions in the BDDC algorithm are constructed from primal constraints on faces. These constrains are similar to the average matching condition and the moment matching con...
متن کاملA Bddc Algorithm for Problems with Mortar Discretization
Abstract. A BDDC (balancing domain decomposition by constraints) algorithm is developed for elliptic problems with mortar discretizations for geometrically non-conforming partitions in both two and three spatial dimensions. The coarse component of the preconditioner is defined in terms of one mortar constraint for each edge/face which is an intersection of the boundaries of a pair of subdomains...
متن کاملA FETI Method for a Class of Indefinite or Complex Second- or Fourth-Order Problems
The FETI-DP domain decomposition method is extended to address the iterative solution of a class of indefinite problems of the form (K−σM)x = b, and a class of complex problems of the form (K − σM + iσD)x = b, where K, M, and D are three real symmetric positive semi-definite matrices arising from the finite element discretization of either second-order elastodynamic problems or fourth-order pla...
متن کامل